An Ehrenfeucht-Fraïssé game approach to collapse results in database theory

An Ehrenfeucht-Fraı̈ssé Game Approach to Collapse Results in Database Theory

We present a new Ehrenfeucht-Fraı̈ssé game approach to collapse results in database theory. We show that, in principle, every natural generic collapse result may be proved via a translation of winning strategies for the duplicator in an Ehrenfeucht-Fraı̈ssé game. Following this approach we can deal with certain infinite databases where previous, highly involved methods fail. We prove the natural ...

An Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory

We present a new Ehrenfeucht-Fraı̈ssé game approach to collapse results in database theory. We show that, in principle, every natural generic collapse result may be proved via a translation of winning strategies for the duplicator in an Ehrenfeucht-Fraı̈ssé game. Following this approach we can deal with certain infinite databases where previous, highly involved methods fail. We prove the natural ...

An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases

We present a new proof technique for collapse results for first–order queries on databases which are embedded in N or R>0. Our proofs are by means of an explicitly constructed winning strategy for Duplicator in an Ehrenfeucht–Fräıssé game, and can deal with certain infinite databases where previous, highly involved methods fail. Our main result is that first–order logic has the natural–generic ...

Trees and Ehrenfeucht-Fraïssé Games

Ehrenfeucht-Fraïssé Goes Automatic for Real Addition

Various logical theories can be decided by automata-theoretic methods. Notable examples are Presburger arithmetic FO(Z, +, <) and the linear arithmetic over the reals FO(R, +, <), for which effective decision procedures can be built using automata. Despite the practical use of automata to decide logical theories, many research questions are still only partly answered in this area. One of these ...